- digital search trees
- Программирование: деревья цифрового поиска
Универсальный англо-русский словарь. Академик.ру. 2011.
digital search trees
Смотреть что такое "digital search trees" в других словарях:
Ternary search tree — In computer science, a ternary search tree (trie,TST) is a ternary (three way) tree data structure which combines the time efficiency of digital tries with the space efficiency of binary search trees. The resulting structure is faster than… … Wikipedia
Nearest neighbor search — (NNS), also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric spaces. The problem is: given a set S of points in a metric space M and a query point… … Wikipedia
Index (search engine) — Search engine indexing collects, parses, and stores data to facilitate fast and accurate information retrieval. Index design incorporates interdisciplinary concepts from linguistics, cognitive psychology, mathematics, informatics, physics, and… … Wikipedia
Concept Search — A concept search (or conceptual search) is an automated information retrieval method that is used to search electronically stored unstructured text (for example, digital archives, email, scientific literature, etc.) for information that is… … Wikipedia
D-Scribe Digital Publishing — program of the University Library System, University of Pittsburgh D Scribe Digital Publishing is an open access electronic publishing program of the University Library System (ULS) of the University of Pittsburgh. It comprises over 100 thematic… … Wikipedia
Culturally modified trees — A culturally modified tree in Gifford Pinchot National Forest, Washington, USA Culturally modified trees (aka CMTs) is a term which describes the modification of trees by indigenous people as part of their tradition. Their meaning for the… … Wikipedia
Neon Trees — performing in San Diego at a special radio show on March 22, 2010. Left to right: Chris Allen, Elaine Bradley, Tyler Glenn, and Branden Campbell. Background information … Wikipedia
Trie — A trie for keys A , to , tea , ted , ten , i , in , and inn . In computer science, a trie, or prefix tree, is an ordered tree data structure that is used to store an associative array where the keys are usually strings. Unlike a binary search… … Wikipedia
Hash tree — A binary hash tree In cryptography and computer science Hash trees or Merkle trees are a type of data structure[citation needed] which contains a tree of summary information about a larger piece of da … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
Computer Go — Part of a series of articles on Go (board game) Game specifics Go rules Go handicaps Go proverbs Go terms Go strategy and tactics Fuseki (whole board openings) Joseki (corner based openings) Life and death Tsumego … Wikipedia
